On Permutation Polytopes - Notions of Equivalence
نویسنده
چکیده
By assigning a permutation polytope to a group we produce new interesting polytopes. For the effective use of this construction method it is desirable to understand which groups are leading to affine equivalent polytopes. Therefore, the notion of effective equivalence has been introduced [BHNP09]. In this note we clarify the notion of effective equivalence and characterize geometrically the effective equivalence permutation groups. Moreover, we present examples showing that the latter do not correspond to affinely equivalent polytopes. We also apply the characterization to the examples. Last but not least notice that we are also providing a framework for the use of representation theoretic methods in the study of permutation polytopes.
منابع مشابه
Relations on words
In the first part of this survey, we present classical notions arising in combinatorics on words: growth function of a language, complexity function of an infinite word, pattern avoidance, periodicity and uniform recurrence. Our presentation tries to set up a unified framework with respect to a given binary relation. In the second part, we mainly focus on abelian equivalence, k-abelian equivale...
متن کاملFaces of Generalized Permutohedra
The aim of the paper is to calculate face numbers of simple generalized permutohedra, and study their f -, hand γvectors. These polytopes include permutohedra, associahedra, graphassociahedra, simple graphic zonotopes, nestohedra, and other interesting polytopes. We give several explicit formulas for h-vectors and γ-vectors involving descent statistics. This includes a combinatorial interpretat...
متن کاملar X iv : m at h / 06 09 18 4 v 2 [ m at h . C O ] 1 8 M ay 2 00 7 FACES OF GENERALIZED PERMUTOHEDRA
The aim of the paper is to calculate face numbers of simple generalized permutohedra, and study their f -, hand γ-vectors. These polytopes include permutohedra, associahedra, graph-associahedra, simple graphic zonotopes, nestohedra, and other interesting polytopes. We give several explicit formulas for h-vectors and γ-vectors involving descent statistics. This includes a combinatorial interpret...
متن کاملTopological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملAll 0-1 Polytopes are Traveling Salesman Polytopes
We study the facial structure of two important permutation polytopes in R n 2 , the Birkho or assignment polytope B n , de ned as the convex hull of all n n permutation matrices, and the asymmetric traveling salesman polytope T n , de ned as the convex hull of those n n permutation matrices corresponding to n-cycles. Using an isomorphism between the face lattice of B n and the lattice of elemen...
متن کامل